Diagram Techniques for Confluence

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Diagram Techniques for Confluence

We develop diagram techniques for proving confluence in abstract reductions systems. The underlying theory gives a systematic and uniform framework in which a number of known results, widely scattered throughout the literature, can be understood. These results include Newman's lemma, Lemma 3.1 of Winkler and Buchberger, the Hindley Rosen lemma, the Request lemmas of Staples, the Strong Confluen...

متن کامل

Diagram Techniques for Connuence

We develop diagram techniques for proving connuence in abstract reductions systems. The underlying theory gives a systematic and uniform framework in which a number of known results, widely scattered throughout the literature, can be understood. These results include Newman's

متن کامل

Diagram Techniques for Con uence

We develop diagram techniques for proving con uence in abstract reduc tions systems The underlying theory gives a systematic and uniform framework in which a number of known results widely scattered through out the literature can be understood These results include Newman s Lemma Lemma of Winkler and Buchberger the Hindley Rosen Lemma the Request Lemmas of Staples the Strong Con uence Lemma of ...

متن کامل

Exploring Better Techniques for Diagram Recognition

A critical component of diagramming sketch tools is their ability to reliably recognise hand-drawn diagram components. This is made difficult by the presence of both geometric shapes and characters in diagrams. The goal of our research is to improve sketch recognition by improving the accuracy in grouping and classifying strokes in a diagram into text characters and shapes. We have done this by...

متن کامل

Symbolic Model Checking Using Interval Diagram Techniques

In this report, a representation of multi-valued functions called interval decision diagrams (IDDs) is introduced. It is related to similar representations as binary decision diagrams. Compared to other model checking strategies, IDDs show some important properties that enable us to verify especially Petri nets, process networks, and related models of computation more adequately than with conve...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Information and Computation

سال: 1998

ISSN: 0890-5401

DOI: 10.1006/inco.1997.2683